0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.15 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.15/0.36 % Computer : n002.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.36 % CPULimit : 1200 0.15/0.36 % WCLimit : 120 0.15/0.36 % DateTime : Tue Jul 13 15:58:03 EDT 2021 0.15/0.37 % CPUTime : 0.15/0.37 % Number of cores: 8 0.15/0.37 % Python version: Python 3.6.8 0.15/0.37 # Version: 2.6rc1-ho 0.15/0.38 # No SInE strategy applied 0.15/0.38 # Trying AutoSched0 for 59 seconds 0.80/1.01 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.80/1.01 # and selection function SelectMaxLComplexAvoidPosPred. 0.80/1.01 # 0.80/1.01 # Preprocessing time : 0.087 s 0.80/1.01 0.80/1.01 # Proof found! 0.80/1.01 # SZS status Theorem 0.80/1.01 # SZS output start CNFRefutation 0.80/1.01 thf(fact_19_sortedTree_Osimps_I2_J, axiom, ![X125:a > int, X40:binary1439146945Tree_a, X1:a, X41:binary1439146945Tree_a]:(binary1721989714Tree_a @ X125 @ (binary717961607le_T_a @ X40 @ X1 @ X41)<=>(((binary1721989714Tree_a @ X125 @ X41&![X14:a]:(member_a @ X14 @ (binary945792244etOf_a @ X41)=>ord_less_int @ (X125 @ X1) @ (X125 @ X14)))&![X14:a]:(ord_less_int @ (X125 @ X14) @ (X125 @ X1)<=member_a @ X14 @ (binary945792244etOf_a @ X40)))&binary1721989714Tree_a @ X125 @ X40)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_19_sortedTree_Osimps_I2_J)). 0.80/1.01 thf(conj_0, conjecture, ord_less_int @ (h @ w) @ (h @ x), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.80/1.01 thf(fact_7_xeqe, axiom, (h @ x)=(h @ e), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_7_xeqe)). 0.80/1.01 thf(fact_1_s, axiom, binary1721989714Tree_a @ h @ (binary717961607le_T_a @ t1 @ x @ t2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1_s)). 0.80/1.01 thf(fact_0_whSet, axiom, member_a @ w @ (binary945792244etOf_a @ t1), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_whSet)). 0.80/1.01 thf(c_0_5, plain, ![X125:a > int, X40:binary1439146945Tree_a, X1:a, X41:binary1439146945Tree_a]:(binary1721989714Tree_a @ X125 @ (binary717961607le_T_a @ X40 @ X1 @ X41)<=>(((binary1721989714Tree_a @ X125 @ X41&![X14:a]:(member_a @ X14 @ (binary945792244etOf_a @ X41)=>ord_less_int @ (X125 @ X1) @ (X125 @ X14)))&![X14:a]:(member_a @ X14 @ (binary945792244etOf_a @ X40)=>ord_less_int @ (X125 @ X14) @ (X125 @ X1)))&binary1721989714Tree_a @ X125 @ X40)), inference(fof_simplification,[status(thm)],[fact_19_sortedTree_Osimps_I2_J])). 0.80/1.01 thf(c_0_6, negated_conjecture, ~ord_less_int @ (h @ w) @ (h @ x), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.80/1.01 thf(c_0_7, plain, ![X2404:a > int, X2405:binary1439146945Tree_a, X2406:a, X2407:binary1439146945Tree_a, X2408:a, X2409:a, X2410:a > int, X2411:binary1439146945Tree_a, X2412:a, X2413:binary1439146945Tree_a]:(((((binary1721989714Tree_a @ X2404 @ X2407|~binary1721989714Tree_a @ X2404 @ (binary717961607le_T_a @ X2405 @ X2406 @ X2407))&(~member_a @ X2408 @ (binary945792244etOf_a @ X2407)|ord_less_int @ (X2404 @ X2406) @ (X2404 @ X2408)|~binary1721989714Tree_a @ X2404 @ (binary717961607le_T_a @ X2405 @ X2406 @ X2407)))&(~member_a @ X2409 @ (binary945792244etOf_a @ X2405)|ord_less_int @ (X2404 @ X2409) @ (X2404 @ X2406)|~binary1721989714Tree_a @ X2404 @ (binary717961607le_T_a @ X2405 @ X2406 @ X2407)))&(binary1721989714Tree_a @ X2404 @ X2405|~binary1721989714Tree_a @ X2404 @ (binary717961607le_T_a @ X2405 @ X2406 @ X2407)))&(((member_a @ (esk111_4 @ X2410 @ X2411 @ X2412 @ X2413) @ (binary945792244etOf_a @ X2411)|(member_a @ (esk110_4 @ X2410 @ X2411 @ X2412 @ X2413) @ (binary945792244etOf_a @ X2413)|~binary1721989714Tree_a @ X2410 @ X2413)|~binary1721989714Tree_a @ X2410 @ X2411|binary1721989714Tree_a @ X2410 @ (binary717961607le_T_a @ X2411 @ X2412 @ X2413))&(~ord_less_int @ (X2410 @ (esk111_4 @ X2410 @ X2411 @ X2412 @ X2413)) @ (X2410 @ X2412)|(member_a @ (esk110_4 @ X2410 @ X2411 @ X2412 @ X2413) @ (binary945792244etOf_a @ X2413)|~binary1721989714Tree_a @ X2410 @ X2413)|~binary1721989714Tree_a @ X2410 @ X2411|binary1721989714Tree_a @ X2410 @ (binary717961607le_T_a @ X2411 @ X2412 @ X2413)))&((member_a @ (esk111_4 @ X2410 @ X2411 @ X2412 @ X2413) @ (binary945792244etOf_a @ X2411)|(~ord_less_int @ (X2410 @ X2412) @ (X2410 @ (esk110_4 @ X2410 @ X2411 @ X2412 @ X2413))|~binary1721989714Tree_a @ X2410 @ X2413)|~binary1721989714Tree_a @ X2410 @ X2411|binary1721989714Tree_a @ X2410 @ (binary717961607le_T_a @ X2411 @ X2412 @ X2413))&(~ord_less_int @ (X2410 @ (esk111_4 @ X2410 @ X2411 @ X2412 @ X2413)) @ (X2410 @ X2412)|(~ord_less_int @ (X2410 @ X2412) @ (X2410 @ (esk110_4 @ X2410 @ X2411 @ X2412 @ X2413))|~binary1721989714Tree_a @ X2410 @ X2413)|~binary1721989714Tree_a @ X2410 @ X2411|binary1721989714Tree_a @ X2410 @ (binary717961607le_T_a @ X2411 @ X2412 @ X2413))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])])). 0.80/1.01 thf(c_0_8, negated_conjecture, ~ord_less_int @ (h @ w) @ (h @ x), inference(split_conjunct,[status(thm)],[c_0_6])). 0.80/1.01 thf(c_0_9, plain, (h @ x)=(h @ e), inference(split_conjunct,[status(thm)],[fact_7_xeqe])). 0.80/1.01 thf(c_0_10, plain, ![X1:a, X14:a, X40:binary1439146945Tree_a, X99:a > int, X41:binary1439146945Tree_a]:(ord_less_int @ (X99 @ X1) @ (X99 @ X14)|~member_a @ X1 @ (binary945792244etOf_a @ X40)|~binary1721989714Tree_a @ X99 @ (binary717961607le_T_a @ X40 @ X14 @ X41)), inference(split_conjunct,[status(thm)],[c_0_7])). 0.80/1.01 thf(c_0_11, plain, binary1721989714Tree_a @ h @ (binary717961607le_T_a @ t1 @ x @ t2), inference(split_conjunct,[status(thm)],[fact_1_s])). 0.80/1.01 thf(c_0_12, negated_conjecture, ~ord_less_int @ (h @ w) @ (h @ e), inference(rw,[status(thm)],[c_0_8, c_0_9])). 0.80/1.01 thf(c_0_13, plain, ![X1:a]:(ord_less_int @ (h @ X1) @ (h @ e)|~member_a @ X1 @ (binary945792244etOf_a @ t1)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_9])). 0.80/1.01 thf(c_0_14, plain, member_a @ w @ (binary945792244etOf_a @ t1), inference(split_conjunct,[status(thm)],[fact_0_whSet])). 0.80/1.01 thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), ['proof']). 0.80/1.01 # SZS output end CNFRefutation 0.80/1.01 # Proof object total steps : 16 0.80/1.01 # Proof object clause steps : 8 0.80/1.01 # Proof object formula steps : 8 0.80/1.01 # Proof object conjectures : 5 0.80/1.01 # Proof object clause conjectures : 3 0.80/1.01 # Proof object formula conjectures : 2 0.80/1.01 # Proof object initial clauses used : 5 0.80/1.01 # Proof object initial formulas used : 5 0.80/1.01 # Proof object generating inferences : 2 0.80/1.01 # Proof object simplifying inferences : 4 0.80/1.01 # Training examples: 0 positive, 0 negative 0.80/1.01 # Parsed axioms : 394 0.80/1.01 # Removed by relevancy pruning/SinE : 0 0.80/1.01 # Initial clauses : 858 0.80/1.01 # Removed in clause preprocessing : 94 0.80/1.01 # Initial clauses in saturation : 764 0.80/1.01 # Processed clauses : 3899 0.80/1.01 # ...of these trivial : 115 0.80/1.01 # ...subsumed : 2090 0.80/1.01 # ...remaining for further processing : 1694 0.80/1.01 # Other redundant clauses eliminated : 479 0.80/1.01 # Clauses deleted for lack of memory : 0 0.80/1.01 # Backward-subsumed : 37 0.80/1.01 # Backward-rewritten : 37 0.80/1.01 # Generated clauses : 26523 0.80/1.01 # ...of the previous two non-trivial : 23262 0.80/1.01 # Contextual simplify-reflections : 20 0.80/1.01 # Paramodulations : 22916 0.80/1.01 # Factorizations : 20 0.80/1.01 # NegExts : 172 0.80/1.01 # Equation resolutions : 526 0.80/1.01 # Propositional unsat checks : 0 0.80/1.01 # Propositional check models : 0 0.80/1.01 # Propositional check unsatisfiable : 0 0.80/1.01 # Propositional clauses : 0 0.80/1.01 # Propositional clauses after purity: 0 0.80/1.01 # Propositional unsat core size : 0 0.80/1.01 # Propositional preprocessing time : 0.000 0.80/1.01 # Propositional encoding time : 0.000 0.80/1.01 # Propositional solver time : 0.000 0.80/1.01 # Success case prop preproc time : 0.000 0.80/1.01 # Success case prop encoding time : 0.000 0.80/1.01 # Success case prop solver time : 0.000 0.80/1.01 # Current number of processed clauses : 1544 0.80/1.01 # Positive orientable unit clauses : 169 0.80/1.01 # Positive unorientable unit clauses: 8 0.80/1.01 # Negative unit clauses : 134 0.80/1.01 # Non-unit-clauses : 1233 0.80/1.01 # Current number of unprocessed clauses: 19997 0.80/1.01 # ...number of literals in the above : 65498 0.80/1.01 # Current number of archived formulas : 0 0.80/1.01 # Current number of archived clauses : 106 0.80/1.01 # Clause-clause subsumption calls (NU) : 446695 0.80/1.01 # Rec. Clause-clause subsumption calls : 230827 0.80/1.01 # Non-unit clause-clause subsumptions : 1218 0.80/1.01 # Unit Clause-clause subsumption calls : 38533 0.80/1.01 # Rewrite failures with RHS unbound : 0 0.80/1.01 # BW rewrite match attempts : 492 0.80/1.01 # BW rewrite match successes : 91 0.80/1.01 # Condensation attempts : 0 0.80/1.01 # Condensation successes : 0 0.80/1.01 # Termbank termtop insertions : 389473 0.80/1.02 0.80/1.02 # ------------------------------------------------- 0.80/1.02 # User time : 0.626 s 0.80/1.02 # System time : 0.019 s 0.80/1.02 # Total time : 0.645 s 0.80/1.02 # Maximum resident set size: 2464 pages 0.80/1.02 EOF